Distributed Forward Checking with Dynamic Ordering
نویسندگان
چکیده
منابع مشابه
Combining Ordering Heuristics and Bundling Techniques for Solving Finite Constraint Satisfaction Problems
We investigate techniques to enhance the performance of backtrack search procedure with forward-checking (FC-BT) for finding all solutions to a finite Constraint Satisfaction Problem (CSP). We consider ordering heuristics for variables and/or values and bundling techniques based on the computation of interchangeability. While the former methods allow us to traverse the search space more effecti...
متن کاملAsynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronous Forward Checking (AFC). The second algorithm, Asynchronous Inter-Level Forward-Checking (AILFC), is based on the AFC-ng algorithm and is performed on a pseudo-tree ordering of the constraint graph. AFC-ng and AILFC ...
متن کاملDynamic Variable Ordering in CSPs
We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We first provide an implementation methodology for adding DVO to an arbitrary tree-search algorithm. Our methodology is applicable to a wide range of algorithms including those that maintain complicated information about the search h...
متن کاملMinimal Forward Checking with Backmarking
The idea behind forward checking is to check forward so that a wrong decision can be detected in early stage during search and thus futile search space can be pruned. However constraint propagation in forward checking may be overdone in certain situations. In this paper we suggest a way to delay constraint evaluation in forward checking with backmarking. Conflict-directed backtracking can also ...
متن کاملOn the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems
We investigate techniques to discover and exploit problem structure in the form of interchangeability. We enhance the performance of backtrack search with forward-checking (FC-BT) for finding all solutions to a finite Constraint Satisfaction Problem(CSP) with dynamic interchangeability detection and dynamic variable ordering. We evaluate these strategies both theoretically and empirically.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001